Applications of Succinct Dynamic Compact Tries to Some String Problems

The dynamic compact trie is a fundamental data structure for a wide range of string processing problems. In this paper, we report our recent work on succinct dynamic compact tries that stores a set of strings of total length n in O(n log σ) space supporting pattern matching and insert/delete operations in O((|P |/α)f(n)) time, where P is a pattern string, α = Θ(logσ n), and f(n) = O((log logn) /log log logn), and its applications to the following string processing problems: (i) online r-suffix tree construction with O(α/f(n)) speed up, (ii) succinct substring index with almost same query time and O(α/f(n)) speed up on preprocessing time, and (iii) dynamic dictionary matching with O(α/f(n)) speed up.